Breadth-first search - PDFSEARCH.IO - Document Search Engine

Breadth-first search
Results: 170

#	Item
121	NPS-MA[removed]NAVAL POSTGRADUATE SCHOOL Monterey, California A Partial Ordering of the Chordal Graphs Add to Reading List Source URL: edocs.nps.edu Language: English - Date: 2004-06-04 13:12:50 Split graph Interval graph Intersection graph Graph Clique Neighbourhood Path decomposition Lexicographic breadth-first search Graph theory Chordal graph Strongly chordal graph
122	14 Example: Pitcher Problem Solver Program file for this chapter: pour Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2003-12-25 21:50:58 Baseball pitching Breadth-first search Tree traversal Information science Tree Win–loss record Depth-first search Solver Search algorithms Mathematics Theoretical computer science
123	Deductive Search for Logic Puzzles Cameron Browne Imperial College London South Kensington, UK [removed] Abstract—Deductive search (DS) is a breadth-first, depthlimited propagation scheme for the constraint-bas Add to Reading List Source URL: www.cameronius.com Language: English - Date: 2014-04-28 03:05:59 Games Nikoli Constraint satisfaction Puzzle Slitherlink Sudoku Local consistency Backtracking Hashiwokakero Logic puzzles Mathematics Theoretical computer science
124	6.001, Fall Semester, 2006—Quiz II – Example Solutions 1 MASSACHVSETTS INSTITVTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science Add to Reading List Source URL: sicp.csail.mit.edu Language: English - Date: 2006-12-05 11:47:20 Functional programming Lisp programming language Search algorithms Breadth-first search Linked list Tree traversal Cons Append Computing Computer programming Declarative programming
125	[removed], Spring Semester, 2007—Quiz II MASSACHVSETTS INSTITVTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.001—Structure and Interpretation of Computer Programs Add to Reading List Source URL: web.mit.edu Language: English - Date: 2008-09-09 11:39:37 Linked list Tree traversal Doubly linked list Computing Information science Computer programming Search algorithms Breadth-first search Best-first search
126	Graph Structure in the Web – Aggregated by Pay-Level Domain Oliver Lehmberg Robert Meusel Add to Reading List Source URL: dws.informatik.uni-mannheim.de Language: English - Date: 2014-05-12 10:05:58 Algebraic graph theory Network analysis Degree Directed graph Vertex Connectivity Webgraph Breadth-first search Clustering coefficient Graph theory Mathematics Network theory
127	Sentiment Flow Through Hyperlink Networks Mahalia Miller†∗ Conal Sathi‡∗ Daniel Wiesenthal‡∗ Jure Leskovec‡ Christopher Potts† Stanford University, Stanford, CA[removed]USA † {mahalia, cgpotts}@stanford.e Add to Reading List Source URL: cs.stanford.edu Language: English - Date: 2012-02-24 13:41:08 Tree Cascade Breadth-first search Artificial intelligence Science Natural language processing Sentiment analysis Objectivity
128	Automatic versus Human Navigation in Information Networks Robert West and Jure Leskovec Computer Science Department Stanford University {west, jure}@cs.stanford.edu Add to Reading List Source URL: cs.stanford.edu Language: English - Date: 2012-03-06 16:25:45 Theoretical computer science Network theory Combinatorial optimization Routing algorithms Binary trees A* search algorithm Breadth-first search Shortest path problem Semantic similarity Mathematics Graph theory Search algorithms
129	Which Networks Are Least Susceptible to Cascading Failures? Larry Blume ∗ David Easley Add to Reading List Source URL: tuvalu.santafe.edu Language: English - Date: 2011-07-12 13:47:40 Connectivity Breadth-first search Graph Tree Graph theory Mathematics Combinatorics
130	2.5 Method of sequential branching. The given method represents a procedure of step-by-step branching at which on each step the best variant of division gets out. Let the possible allowable complexity of a tree (for exam Add to Reading List Source URL: www.math.nsc.ru Language: English - Date: 2004-10-12 13:38:54 Computational complexity theory Mathematics Applied mathematics Breadth-first search Grafting Decision trees Theoretical computer science Search algorithms

UPDATE